翻訳と辞書 Words near each other ・ Heteronychus arator ・ Heteronygmia ・ Heteronym ・ Heteronym (linguistics) ・ Heteronym (literature) ・ Heteronympha ・ Heteronympha banksii ・ Heteronympha merope ・ Heteronyx queenlandicus ・ Heteroousianism ・ Heteropacha ・ Heteropalpia ・ Heteropalpia acrosticta ・ Heteropalpia profesta ・ Heteropalpoides aberrans ・ Heterogeneous Earliest Finish Time ・ Heterogeneous Element Processor ・ Heterogeneous network ・ Heterogeneous nuclear ribonucleoprotein A1 ・ Heterogeneous random walk in one dimension ・ Heterogeneous ribonucleoprotein particle ・ Heterogeneous System Architecture ・ Heterogeneous water oxidation ・ Heterogeneous wireless network ・ Heteroglenea ・ Heteroglossia ・ Heteroglycan alpha-mannosyltransferase ・ Heterogobius chiloensis ・ Heterogony of ends ・ Heterogram Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Heterogeneous Earliest Finish Time ： ウィキペディア英語版 Heterogeneous Earliest Finish Time Heterogeneous Earliest Finish Time (or HEFT) is a heuristic to schedule a set of dependent tasks onto a network of heterogeneous workers taking communication time into account. For inputs HEFT takes a set of tasks, represented as a directed acyclic graph, a set of workers, the times to execute each task on each worker, and the times to communicate the results from each job to each of its children between each pair of workers. It descends from list scheduling algorithms. == Algorithm == HEFT executes in two phases. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Heterogeneous Earliest Finish Time」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.